Efficient and Effective Pair-Matching Algorithms for Agent-Based Models
نویسندگان
چکیده
منابع مشابه
Efficient Parallel Algorithms for Template Matching
The parallel complexity of template matching has been well studied. In this paper we present more work-eÆcient algorithms than the existing ones. Our algorithms are based on FFT primitives. We consider the following models of computing: PRAM and the hypercube.
متن کاملEfficient algorithms for robust feature matching
One of the basic building blocks in any point-based registration scheme involves matching feature points that are extracted from a sensed image to their counterparts in a reference image. This leads to the fundamental problem of point matching: Given two sets of points, find the (affine) transformation that transforms one point set so that its distance from the other point set is minimized. Bec...
متن کاملEfficient Approximation Algorithms for Weighted b-Matching
We describe a half-approximation algorithm, b-Suitor, for computing a b-Matching of maximum weight in a graph with weights on the edges. b-Matching is a generalization of the well-known Matching problem in graphs, where the objective is to choose a subset of M edges in the graph such that at most a specified number b(v) of edges in M are incident on each vertex v. Subject to this restriction we...
متن کاملEfficient algorithms for (δ, γ, α)-matching
We propose new algorithms for (δ, γ, α)-matching. In this string matching problem we are given a pattern P = p0p1 . . . pm−1 and a text T = t0t1 . . . tn−1 over some integer alphabet Σ = {0 . . . σ − 1}. The pattern symbol pi matches the text symbol tj iff |pi − tj | ≤ δ. The pattern P (δ, γ)-matches some text substring tj . . . tj+m−1 iff for all i it holds that |pi − tj+i| ≤ δ and P |pi − tj+...
متن کاملEfficient EREW PRAM Algorithms for Parentheses-Matching
We present four polylog-time parallel algorithms for matching parentheses on an exclusive-read and exclusive-write (EREW) parallel random-access machine (PRAM) model. These algorithms provide new insights into the parentheses-matching problem. The first algorithm has a time complexity of O( log’ n ) employing O( & ) processors for an input string containing ~1 parentheses. Although this algorit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Artificial Societies and Social Simulation
سال: 2017
ISSN: 1460-7425
DOI: 10.18564/jasss.3485